A minimax fitting algorithm for ultra-precision aspheric surfaces
نویسندگان
چکیده
منابع مشابه
A Minimax Fitting Algorithm for Ultra-Precision Aspheric Surfaces
Aspheric lenses show significant superiority over traditional spherical ones. The peak-to-valley form deviation is an important criterion for surface qualities of optical lenses. The peak-to-valley errors obtained using traditional methods are usually greater than the actual values, as a consequence causing unnecessary rejections. In this paper the form errors of aspheric surfaces are evaluated...
متن کاملUltra-precision Machining Systems; an Enabling Technology for Perfect Surfaces
The technology of ultra-precision machining, spanning almost three decades, has only in recent years experienced major advances in machine design and, subsequently, performance and productivity. In the 1970’s, ultra-precision machining techniques were successfully adopted for the manufacture of computer memory discs used in hard drives, and also photoreceptor components used in many photocopier...
متن کاملA New Approach to Characterising Aspheric Surfaces
In this paper, a new approach to fitting aspheric surfaces in three-dimensional space is proposed, based on the nonlinear least-squares algorithm. The method is superior to conventional solutions as all the surface parameters can be estimated simultaneously based on the design equation, thus allowing the result to be directly compared to design parameters. Conventionally, aspheric surfaces can ...
متن کاملRobust and precise algorithm for aspheric surfaces characterization by the conic section
Background: A new algorithm for precise characterisation of rotationally symmetric aspheric surfaces by the conic section and polynomial according to the ISO 10110 standard is described. Methods: The algorithm uses only the iterative linear least squares. It uses fitting the surface form in a combination with terms containing its spatial derivatives that represent infinitesimal transformations ...
متن کاملA Genetic Algorithm for Minimax Optimization Problems
Robust discrete optimization is a technique for structuring uncertainty in the decision-making process. The objective is to find a robust solution that has the best worst-case performance over a set of possible scenarios. However, this is a difficult optimization problem. This paper proposes a two-space genetic algorithm as a general technique to solve minimax optimization problems. This algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2011
ISSN: 1742-6596
DOI: 10.1088/1742-6596/311/1/012031